Are Short Proofs Narrow? Qbf Resolution Is Not Simple. Our Contributions
نویسندگان
چکیده
The groundbreaking paper ‘Short proofs are narrow – resolution made simple’ by Ben-Sasson and Wigderson (J. ACM 2001) introduces what is today arguably the main technique to obtain resolution lower bounds: to show a lower bound for the width of proofs. Another important measure for resolution is space, and in their fundamental work, Atserias and Dalmau (J. Comput. Syst. Sci. 2008) show that space lower bounds again can be obtained via width lower bounds. Here we assess whether similar techniques are effective for resolution calculi for quantified Boolean formulas (QBF). A mixed picture emerges. Our main results show that both the relations between size and width as well as between space and width drastically fail in Q-resolution, even in its weaker tree-like version. On the other hand, we obtain positive results for the expansion-based resolution systems ∀Exp+Res and IR-calc, however only in the weak tree-like models. Technically, our negative results rely on showing width lower bounds together with simultaneous upper bounds for size and space. For our positive results we exhibit space and widthpreserving simulations between QBF resolution calculi.
منابع مشابه
Are Short Proofs Narrow? QBF Resolution is not Simple
The groundbreaking paper ‘Short proofs are narrow – resolution made simple’ by Ben-Sasson and Wigderson (J. ACM 2001) introduces what is today arguably the main technique to obtain resolution lower bounds: to show a lower bound for the width of proofs. Another important measure for resolution is space, and in their fundamental work, Atserias and Dalmau (J. Comput. Syst. Sci. 2008) show that low...
متن کاملMore on Size and Width in QBF Resolution
In their influential paper ‘Short proofs are narrow – resolution made simple’ [3], Ben-Sasson and Wigderson introduced a crucial tool for proving lower bounds on the lengths of proofs in the resolution calculus. Over a decade later their technique for showing lower bounds on the size of proofs, by examining the width of all possible proofs, remains one of the most effective lower bound techniqu...
متن کاملEfficient Extraction of QBF (Counter)models from Long-Distance Resolution Proofs
Many computer science problems can be naturally and compactly expressed using quantified Boolean formulas (QBFs). Evaluating the truth or falsity of a QBF is an important task, and constructing the corresponding model or countermodel can be as important and sometimes even more useful in practice. Modern search and learning based QBF solvers rely fundamentally on resolution and can be instrument...
متن کاملShort Proofs for Some Symmetric Quantified Boolean Formulas
We exploit symmetries to give short proofs for two prominent formula families of QBF proof complexity. On the one hand, we employ symmetry breakers. On the other hand, we enrich the (relatively weak) QBF resolution calculus Q-Res with the symmetry rule and obtain separations to powerful QBF calculi.
متن کاملFormulas with Large Weight: a New Technique for Genuine QBF Lower Bounds
We devise a new technique to prove lower bounds for the proof size in resolutiontype calculi for quantified Boolean formulas (QBF). The new technique applies to the strong expansion system IR-calc and thereby also to the most studied QBF system Q-Resolution. Our technique exploits a clear semantic paradigm, showing the hardness of a QBF family by demonstrating that (1) the formulas require larg...
متن کامل